parser combinators造句

例句与造句

1. Only parser combinators are faster in Haskell.
2. The simple implementations of parser combinators have some shortcomings, which are common in top-down parsing.
3. Following the definitions of two basic recognizers p and q, we can define two major parser combinators for alternative and sequencing:
4. The same authors also described their implementation of a set of parser combinators written in the Haskell programming language based on the same algorithm.
5. Parser combinators thereby enable parsers to be defined in an embedded style, in code which is similar in structure to the rules of the formal grammar.
6. It's difficult to find parser combinators in a sentence. 用parser combinators造句挺难的
7. In 1989, Richard Frost and John Launchbury demonstrated use of parser combinators to construct Haskell that solve the long-standing problem of accommodating left recursion, and work as a complete top-down parsing tool in polynomial time and space.
8. Frost, Hafiz and Callaghan also described the implementation of the algorithm in PADL 08 as a set of higher-order functions ( called parser combinators ) in Haskell, which enables the construction of directly executable specifications of CFGs as language processors.